Computing k-Link Visibility Polygons in Environments with a Reflective Edge
نویسندگان
چکیده
In this paper we consider the k-link visibility polygon of an object inside a polygonal environment with a reflective edge called a mirror. The k-link visibility polygon of an object inside a polygon P is the set of all points in P , which are visible to some points of that object with at most k − 1 intermediate points, under the property that consecutive intermediate points are mutually visible. We propose an optimal linear time algorithm for computing the k-link visibility polygon of an object inside a polygon P with a reflective edge. The object can be a point, a segment or a simple polygon. We observed that in computing k-link visibility polygons the mirror can affect in only two levels. We explain how to handle these levels efficiently to achieve an optimal algorithm.
منابع مشابه
Single-Point Visibility Constraint Minimum Link Paths in Simple Polygons
We address the following problem: Given a simple polygon $P$ with $n$ vertices and two points $s$ and $t$ inside it, find a minimum link path between them such that a given target point $q$ is visible from at least one point on the path. The method is based on partitioning a portion of $P$ into a number of faces of equal link distance from a source point. This partitioning is essentially a shor...
متن کاملA Fast Algorithm for Covering Rectangular Orthogonal Polygons with a Minimum Number of r-Stars
Introduction This paper presents an algorithm for covering orthogonal polygons with minimal number of guards. This idea examines the minimum number of guards for orthogonal simple polygons (without holes) for all scenarios and can also find a rectangular area for each guards. We consider the problem of covering orthogonal polygons with a minimum number of r-stars. In each orthogonal polygon P,...
متن کاملOptimal Mesh Computer Algorithms for Simple Polygons
We present optimal parallel algorithms that run in O(p n) time on a p n p n mesh-connected computer for a number of fundamental problems concerning visibility and distance properties inside a simple polygon. These include computing shortest paths, shortest path trees, shortest path partitions, all-farthest neighbors (both internal and external), the visibility polygon of a point, the weak visib...
متن کاملComputing the Visibility Polygons of the Endpoints of a Set of Line Segments in Output Sensitive Time
Given a set S of n non-intersecting line segments in the plane, we present an algorithm that computes the 2n visibility polygons of the endpoints of S, in output sensitive time. The algorithm relies on the ordered endpoint visibility graph information to traverse the endpoints of S in a spiral-like manner using a combination of Jarvis' March and depthrst search. One extension of this result is ...
متن کاملNon-stretchable pseudo-visibility graphs
We exhibit a family of graphs which can be realized as pseudo-visibility graphs of pseudo-polygons, but not of straight-line polygons. The example is based on the characterization of vertex-edge pseudo-visibility graphs of O’Rourke and Streinu [Proc. ACM Symp. Comput. Geometry, Nice, France, 1997, pp. 119–128] and extends a recent result of the author [Proc. ACM Symp. Comput. Geometry, Miami Be...
متن کامل